Structured Eigenvalue Problems
نویسندگان
چکیده
Most eigenvalue problems arising in practice are known to be structured. Structure is often introduced by discretization and linearization techniques but may also be a consequence of properties induced by the original problem. Preserving this structure can help preserve physically relevant symmetries in the eigenvalues of the matrix and may improve the accuracy and efficiency of an eigenvalue computation. The purpose of this brief survey is to highlight these facts for some common matrix structures. This includes a treatment of rather general concepts such as structured condition numbers and backward errors as well as an overview of algorithms and applications for several matrix classes including symmetric, skew-symmetric, persymmetric, block cyclic, Hamiltonian, symplectic and orthogonal matrices.
منابع مشابه
Backward errors and pseudospectra for structured nonlinear eigenvalue problems
Minimal structured perturbations are constructed such that an approximate eigenpair of a nonlinear eigenvalue problem in homogeneous form is an exact eigenpair of an appropriately perturbed nonlinear matrix function. Structured and unstructured backward errors are compared. These results extend previous results for (structured) matrix polynomials to more general functions. Structured and unstru...
متن کاملPalindromic Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
Palindromic polynomial eigenvalue problems and related classes of structured eigenvalue problems are considered. These structures generalize the concepts of symplectic and Hamiltonian matrices to matrix polynomials. We discuss several applications where these matrix polynomials arise, and show how linearizations can be derived that reflect the structure of all these structured matrix polynomial...
متن کاملA Chart of Backward Errors for Singly and Doubly Structured Eigenvalue Problems
We present a chart of structured backward errors for approximate eigenpairs of singly and doubly structured eigenvalue problems. We aim to give, wherever possible, formulae that are inexpensive to compute so that they can be used routinely in practice. We identify a number of problems for which the structured backward error is within a factor √ 2 of the unstructured backward error. This paper c...
متن کاملStructured eigenvalue condition numbers and linearizations for matrix polynomials
This work is concerned with eigenvalue problems for structured matrix polynomials, including complex symmetric, Hermitian, even, odd, palindromic, and anti-palindromic matrix polynomials. Most numerical approaches to solving such eigenvalue problems proceed by linearizing the matrix polynomial into a matrix pencil of larger size. Recently, linearizations have been classified for which the penci...
متن کاملFast Condition Estimation for a Class of Structured Eigenvalue Problems
We present a fast condition estimation algorithm for the eigenvalues of a class of structured matrices. These matrices are low rank modifications to Hermitian, skew-Hermitian, and unitary matrices. Fast structured operations for these matrices are presented, including Schur decomposition, eigenvalue block swapping, matrix equation solving, compact structure reconstruction, etc. Compact semisepa...
متن کامل